Finite-source Retrial Queues with Applications*

We consider a single-server retrial queueing system with a finite number of homogeneous sources generating requests after a random time. The service of an arriving customer finding the server idle starts immediately; otherwise the request enters into an orbit from where the calls are repeated after a random time. Upon completion of a service, with a certain probability the server searches for an orbiting customer. We assume the search time to be negligible. While modeling generation, retrial, and service times by their first two moments, we are interested in steady-state performance measures. The novelty of the investigation is the discussion of the second moment’s effect on the performance of finite-source retrial queues with orbital search. The MOSEL-2 tool is used to formulate and solve the problem resulting in various illustrative numerical examples showing the effect of the the moments and the search probability on the mean response time of the requests.